Synchronization problem on networking and synthesis based on algebraic graph theory
نویسندگان
چکیده
منابع مشابه
Segmentation of Magnetic Resonance Brain Imaging Based on Graph Theory
Introduction: Segmentation of brain images especially from magnetic resonance imaging (MRI) is an essential requirement in medical imaging since the tissues, edges, and boundaries between them are ambiguous and difficult to detect, due to the proximity of the brightness levels of the images. Material and Methods: In this paper, the graph-base...
متن کاملtranslation of collocations from english into persian, based on ghazalas theory
غزالا همایندها را به صورت ترکیبی از دو یا چند واژه که همواره در متون مختلف زبان ها همراه با هم می آیند تعریف می نماید. از دیدگاه او روند رو به رشد میل به ترجمه ی همایندها در مطالعات ترجمه، به دلیل اهمیت آنها در انسجام ساختار زبان است. این پایان نامه اساسا به ترجمه ی همایندها منحصر شده است. هدف آن بررسی کاربرد راهکارهای غزالا در مورد ترجمه ی همایندها از انگلیسی به فارسی است. هدف دیگر آن یافتن پر...
15 صفحه اولSoil and Rock Slope Stability Analysis based on Numerical Manifold Method and Graph Theory
Limit equilibrium method, strength reduction method and Finite Difference Methods are the most prevalently used methods for soil and rock slope stability analysis. However, it can be mention that those have some limitations in practical application. In the Limit equilibrium method, the constitutive model cannot be considered and many assumptions are needed between slices of soil and rock. The s...
متن کاملOn algebraic graph theory and the dynamics of innovation networks
We investigate some of the properties and extensions of a dynamic innovation network model recently introduced in [36]. In the model, the set of efficient graphs ranges, depending on the cost for maintaining a link, from the complete graph to the (quasi-) star, varying within a well defined class of graphs. However, the interplay between dynamics on the nodes and topology of the network leads t...
متن کاملOn a problem in extremal graph theory
The number T*(n, k) is the least positive integer such that every graph with n = (*:I) + t vertices (t > 0) and at least T*(n, k) edges contains k mutually vertex-disjoint complete subgraphs S, , S, ,..., Sk where S, has ivertices, I < i Q k. Obviously T*(n, k) > T(n, k), the Turan number of edges for a Ki . It is shown that if n > gkk” then equality holds and that there is c :0 such that for (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Malaya Journal of Matematik
سال: 2018
ISSN: 2319-3786,2321-5666
DOI: 10.26637/mjm0s01/10